Inductive characterisation of database relations

نویسنده

  • Peter A. Flach
چکیده

The general claims of this paper are twofold: there are challenging problems for Machine Learning in the field of Databases, and the study of these problems leads to a deeper understanding of Machine Learning. To support the first claim, we consider the problem of characterising a database relation in terms of high-level properties, i.e. attribute dependencies. The problem is reformulated to reveal its inductive nature. To support the second claim, we show that the problems presented here do not fit well into the current framework for inductive learning, and we discuss the outline of a more general theory of inductive learning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Study on Classification Approaches across Multiple Database Relations

Classification is an important task in data mining and machine learning, which has been studied extensively and has a wide range of applications. Lots of algorithms have been proposed to build accurate and scalable classifiers. Most of these algorithms can only applied to single “flat“ relations, whereas in the real world most data are stored in multiple tables. As converting data from multiple...

متن کامل

A Study on Classification Approaches across Multiple Database Relations

Classification is an important task in data mining and machine learning, which has been studied extensively and has a wide range of applications. Lots of algorithms have been proposed to build accurate and scalable classifiers. Most of these algorithms can only applied to single “flat“ relations, whereas in the real world most data are stored in multiple tables. As converting data from multiple...

متن کامل

A Note on Logical Relations Between Semantics and Syntax

This note gives a new proof of the ‘operational extensionality’ property of Abramsky’s lazy lambda calculus—namely the coincidence of contextual equivalence with a co-inductively defined notion of ‘applicative bisimilarity’. This purely syntactic result is here proved using a logical relation (due to Plotkin) between the syntax and its denotational semantics. The proof exploits a mixed inductiv...

متن کامل

An Inductive Logic Programming Query Language for Database Mining

First, a short introduction to inductive logic programming and machine learning is presented and then an inductive database mining query language RDM (Relational Database Mining language). RDM integrates concepts from inductive logic programming, constraint logic programming, deductive databases and meta-programming into a flexible environment for relational knowledge discovery in databases. Th...

متن کامل

A New Characterisation of Information Capacity Equivalence in Nested Relations

Nested relations are an important subclass of object-relational systems that are now being widely used in industry. Also, a subclass of nested relations, partitioned normal form (PNF) relations, is important because the semantics and manipulation of these relations are more transparent than general nested relations. In this paper we address the question of determining when every PNF relation st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990